Tightening a Discrete Formulation of the Quadratic Assignment Problem
نویسندگان
چکیده
The quadratic assignment problem is a well studied and notoriously difficult combinatorial problem. Recently, a discrete linear formulation of the quadratic assignment problem was presented that solved five previously unsolved instances from the quadratic assignment library, QAPLIB, to optimality. That formulation worked especially well on sparse instances. In this paper we show how to tighten that formulation by adding cuts to the auxiliary variables. The cuts are derived from solving linear programming problems before solving the main problem. The linear programming problems are easily solved even for larger instances and therefore many cuts can be added without any considerable change of computing time. With only a few cuts we can improve the root node bound considerably.
منابع مشابه
A quadratic assignment formulation of the molecular conformation problem
The molecular conformation problem is discussed, and a concave quadratic global minimization approach for solving it is described. This approach is based on a quadratic assignment formulation of a discrete approximation to the original problem.
متن کاملRobust Quadratic Assignment Problem with Uncertain Locations
We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...
متن کاملEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملFrom combinatorial optimization to real algebraic geometry and back
In this paper, we explain the relations between combinatorial optimization and real algebraic geometry with a special focus to the quadratic assignment problem. We demonstrate how to write a quadratic optimization problem over discrete feasible set as a linear optimization problem over the cone of completely positive matrices. The latter formulation enables a hierarchy of approximations which r...
متن کامل